πŸ‘©β€πŸ’» 77485. ν–‰λ ¬ ν…Œλ‘λ¦¬ νšŒμ „ν•˜κΈ°

@Seongukbaek Posted July 02, 2022 Β· Updated July 02, 2022 Β· 2 min read

문제

Programmers - ν–‰λ ¬ ν…Œλ‘λ¦¬ νšŒμ „ν•˜κΈ°

πŸ“ Logic

private int rotation(int x1, int y1, int x2, int y2) {...}
  • μ£Όμ–΄μ§„ 두 μ’Œν‘œλ₯Ό κΈ°μ€€μœΌλ‘œ, μ™Όμͺ½ 쀄, μ•„λž« 쀄, 였λ₯Έμͺ½ 쀄, μœ— 쀄 순으둜 행렬을 νšŒμ „μ‹œν‚€λ©΄μ„œ, μ΅œμ†Ÿκ°’μ„ μ°ΎλŠ” ν•¨μˆ˜

πŸ“„ CODE

μ½”λ“œ 보기/μ ‘κΈ°πŸ’«
class Solution { static int[][] map; public int[] solution(int rows, int columns, int[][] queries) { int[] answer = new int[queries.length]; int idx = 0; init(rows, columns); for (int[] query : queries) answer[idx++] = rotation(query[0] - 1, query[1] - 1, query[2] - 1, query[3] - 1); return answer; } private void init(int rows, int columns) { map = new int[rows][columns]; int num = 1; for (int i = 0; i < rows; i++) for (int j = 0; j < columns; j++) map[i][j] = num++; } private int rotation(int x1, int y1, int x2, int y2) { int w = y2 - y1; int h = x2 - x1; int value = map[x1][y1]; int min = value; // μ™Όμͺ½ 쀄 이동 for (int i = x1 + 1; i <= x1 + h; i++) { int moveN = map[i][y1]; if (min > moveN) min = moveN; map[i - 1][y1] = moveN; } // μ•„λž« 쀄 이동 for (int j = y1 + 1; j <= y1 + w; j++) { int moveN = map[x2][j]; if (min > moveN) min = moveN; map[x2][j - 1] = moveN; } // 였λ₯Έμͺ½ 쀄 이동 for (int i = x2 - 1; i >= x1; i--) { int moveN = map[i][y2]; if (min > moveN) min = moveN; map[i + 1][y2] = moveN; } // μœ— 쀄 이동 for (int j = y2 - 1; j > y1; j--) { int moveN = map[x1][j]; if (min > moveN) min = moveN; map[x1][j + 1] = moveN; } map[x1][y1 + 1] = value; return min; } }

✏️ Review

  • 문제 μžμ²΄λŠ” μ‰¬μš°λ‚˜, 인덱슀 보닀가 λˆˆμ•Œ λΉ μ Έλ²„λ¦¬λŠ” 문제
@Seongukbaek
배우고 μ •λ¦¬ν•˜κ³  κ³΅μœ ν•˜λŠ” λŒ€ν•™μƒ λ°±μ„±μš±μž…λ‹ˆλ‹€ πŸ˜€